Gödel logics with monotone operators

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotone operators on Gödel logic

4 We consider an extension of Gödel logic by a unary operator that enables the addition of nonnegative reals to truth-values. Although its propositional fragment has a simple proof system, first-order validity is Π2-hard. We explain the close connection to Scarpellini’s result on Π2hardness of Łukasiewicz’s logic.

متن کامل

Compact Propositional Gödel Logics

Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the on...

متن کامل

Standard Gödel Modal Logics

We prove strong completeness of the -version and the 3-version of a Gödel modal logic based on Kripke models where propositions at each world and the accessibility relation are both in…nitely valued in the standard Gödel algebra [0,1]. Some asymmetries are revealed: validity in the …rst logic is reducible to the class of frames having twovalued accessibility relation and this logic does not enj...

متن کامل

First-order Gödel logics

First-order Gödel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics GV (sets of those formulas which evaluate to 1 in every interpretation into V ). It is shown that GV is axiomatizable iff V is finite, V is uncountable with 0 isolated in V , or eve...

متن کامل

Gödel Homomorphisms as Gödel Modal Operators

We extend propositional Gödel logic by a unary modal operator, which we interpret as 5 Gödel homomorphisms, i.e. functions [0, 1] → [0, 1] that distribute over the interpretations of the 6 binary connectives of Gödel logic. We show that validity in the propositional fragment has a simple 7 superintuitionistic Hilbert-type proof system, which is not structurally complete, and that validity 8 doe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fuzzy Sets and Systems

سال: 2012

ISSN: 0165-0114

DOI: 10.1016/j.fss.2011.04.012